Minimize the maximum value in array by incrementing and decrementing.
Given array arr[] of size N, the task is to minimize the maximum value in given array by increasing arr[i] by 1 and decreasing arr[i + 1] by 1 any number of times....
read more
Designing Deterministic Finite Automata (Set 1)
...
read more
Bakery Algorithm in Process Synchronization
Prerequisite – Critical Section, Process Synchronization, Inter Process Communication The Bakery algorithm is one of the simplest known solutions to the mutual exclusion problem for the general case of N process. Bakery Algorithm is a critical section solution for N processes. The algorithm preserves the first come first serve property....
read more
Graph Coloring for Competitive Programming
Graph coloring in programming refers to the assignment of colors to the vertices of a graph in a way that no two adjacent vertices share the same color. In this article, we will cover the concepts of Graph coloring, why is it important to learn for Competitive Programming and other related concepts like: Bipartite Graph, Chromatic Number, etc....
read more
Architecture of 8085 microprocessor
Introduction :...
read more
CPU Scheduling in Operating Systems
Scheduling of processes/work is done to finish the work on time. CPU Scheduling is a process that allows one process to use the CPU while another process is delayed (in standby) due to unavailability of any resources such as I / O etc, thus making full use of the CPU. The purpose of CPU Scheduling is to make the system more efficient, faster, and fairer....
read more
Process Schedulers in Operating System
In computing, a process is the instance of a computer program that is being executed by one or many threads. Scheduling is important in many different computer environments. One of the most important areas of scheduling is which programs will work on the CPU. This task is handled by the Operating System (OS) of the computer and there are many different ways in which we can choose to configure programs....
read more
Minimum jumps to move outside the matrix
Given a grid of size NXN, some of the cells are vacant and some are blocked. We can move to any horizontally or vertically adjacent cell if the cell is vacant. Also, we can jump to a vacant cell in the 5×5 area centered at the square we are currently in. Starting from the cell (r1, c1), find the minimum number of jumps to reach cell (r2, c2). A vacant cell is denoted by ‘.’ and a blocked cell is denoted by ‘#’....
read more
Dielectric Heating
Within the ever-changing field of modern heating technology, dielectric heating stands out as a ground-breaking and effective technique with a wide range of uses. This creative approach of heating introduces an evolutionary change in business procedures by using the exact control of dielectric materials as its basis. Dielectric heating, in contrast to traditional techniques, uses the inherent properties of non-conductive materials to produce heat through molecular friction when exposed to an alternating electric power source....
read more
Building Data Pipelines with Google Cloud Dataflow: ETL Processing
In today’s fast fast-moving world, businesses face the challenge of efficiently processing and transforming massive quantities of data into meaningful insights. Extract, Transform, Load (ETL) tactics play a vital function in this journey, enabling corporations to transform raw data into a structured and actionable format. Google Cloud gives a powerful solution for ETL processing called Dataflow, a completely managed and serverless data processing service. In this article, we will explore the key capabilities and advantages of ETL processing on Google Cloud and the use of Dataflow....
read more
Restore the original array from another array generated by given operations
Given an array b. The array b is obtained initially by array a, by doing the following operations....
read more
Combinatorics: How many Words with 2 Different Vowels and 2 Different Consonants can be Formed from Alphabet?
Combinatorics is a branch of mathematics that focuses on studying the selection, arrangement, and operation of countable discrete structures. This is essential in computer science because it can be used to solve problems regarding statistics and probability. Moreover, combinatorics also plays a big role in the optimization of various applications. Combination and Permutation are two terms that are often used to solve problems in combinatorics....
read more